Abstraction Planning in Real Time
نویسندگان
چکیده
ION PLANNING IN REAL TIME a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy By Richard Washington March 1994 c Copyright 1994 by Richard Washington All Rights Reserved
منابع مشابه
Practical Real-Time Planning
Optimal real-time planning at run time is impossible for complex domains, since planning is intractable. "Reactive" planning has opted for pre-colnpiled plans, but such plans cannot cope with changing goals, and the space of pre-compiled plans is too large to store for a complex domain. Heuristics can prune planning so that it is of more manageable complexity, but there is still no guarantee th...
متن کاملGraph Abstraction in Real-time Heuristic Search
Real-time heuristic search methods are used by situated agents in applications that require the amount of planning per move to be independent of the problem size. Such agents plan only a few actions at a time in a local search space and avoid getting trapped in local minima by improving their heuristic function over time. We extend a wide class of real-time search algorithms with automatically-...
متن کاملPLANNER TAP Compiler SCHEDULER
ion for Real-time Intelligent Control: Extended Abstract Robert P. Goldman, David J. Musliner, Mark S. Boddy, Kurt D. Krebsbach Automated Reasoning Group Honeywell Technology Center 3660 Technology Drive Minneapolis, MN 55418 fgoldman,musliner,boddy,[email protected] Introduction In this paper we discuss two abstraction techniques we use in CIRCA planning (Musliner, Durfee, & Shin 199...
متن کاملA Hierarchical Task Network Planner for Pathfinding in Real-Time Strategy Games
In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN ...
متن کاملContinual Planning with Time-Oriented, Skeletal Plans
In dynamically changing environments a planning system does not have all the required information at the first place and the world state can change, rendering the original plan invalid. Consequently, taking planning to complex, real-world domains calls for close coupling of planning and plan execution, known as continual planning. In domains where a high degree of adaptability is crucial and li...
متن کاملState Abstraction in Real-time Heuristic Search: The Director’s Cut
Real-time heuristic search methods are used by situated agents in applications that require the amount of planning per move to be independent of the problem size. Such agents plan only a few actions in a local search space and avoid getting trapped in local minima by improving their heuristic function over time. We extend a wide class of real-time search algorithms with automatically built stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998